Realization and partial fractions
نویسندگان
چکیده
منابع مشابه
Minimal stable partial realization
An asymptotically stable minimal order realization of a partial sequence of Markov parameters is achieved by reducing the problem to a standard but minimal one in decision algebra. Summary—In this paper two equivalent sets of necessary and sufficient conditions for the existence of an asymptotically stable partial realization are developed. Both sets are expressed as multivariable polynomial eq...
متن کاملRational Functions and Partial Fractions
Our final integration technique deals with the class of functions known as rational functions. Recall from Calculus I that DEFINITION 7.1. A rational function 1 is a function that is the ratio of two polynomials 1 Here 'rational' means 'ratio', as in 'the ratio of two polynomials.' r(x) = p(x) q(x) , where p(x) and q(x) are polynomials. (Remember a polynomial has the form p(x) = a n x n + a n−1...
متن کاملOn the partial realization problem
We consider here a two sided interpolation problem where we want to minimize the degree of the interpolant. We show that this degree is given by the rank of a particular solution to a Sylvester equation which, in some particular cases becomes a Löwner or a Hankel matrix. We consider an application to the usual partial realization problem. The results are quite general and no particular assumpti...
متن کاملPartial realization of descriptor systems
We address the partial realization problem for linear descriptor systems. A general solution to this problem using the Markov parameters of the system defined via its Laurent series is provided. For proper descriptor systems, we also discuss a numerically feasible algorithm for computing a partial minimal realization based on the unsymmetric Lanczos process. Applications to model reduction for ...
متن کاملCOMPUTATION OF q-PARTIAL FRACTIONS
We study a special partial fraction technique which is designed for rational functions with poles on the unit circle, known as q-fractions. Even though the theory of q-partial fractions has already been applied to the Rademacher Conjecture, no systematic computational development appeared. In this paper we present two algorithms for the computation of q-partial fractions and highlight certain p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90179-e